Optimal top dag compression
نویسندگان
چکیده
It is shown that for a given ordered node-labelled tree of size $n$ and with $s$ many different node labels, one can construct in linear time a top dag of height $O(\log n)$ and size $O(n / \log_\sigma n) \cap O(d \cdot \log n)$, where $\sigma = \max\{ 2, s\}$ and $d$ is the size of the minimal dag. The size bound $O(n / \log_\sigma n)$ is optimal and improves on previous bounds.
منابع مشابه
Tree Compression with Top Trees
Abstract. We introduce a new compression scheme for labeled trees based on top trees [3]. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast navigational queries directly on the compressed representation. We show that the new compre...
متن کاملSlowing Down Top Trees for Better Worst-Case Bounds
We consider the top tree compression scheme introduced by Bille et al. [ICALP 2013] and construct an infinite family of trees on n nodes labeled from an alphabet of size σ, for which the size of the top DAG is Θ( n logσ n log logσ n). Our construction matches a previously known upper bound and exhibits a weakness of this scheme, as the information-theoretic lower bound is Ω( n logσ n ). This se...
متن کاملCompression of Image Contours using Combinatorial Optimization
Compression of image contours is an important problem in many contexts. An example is object oriented video coding, where eecient encoding of shape information of arbitrarily shaped objects is a major problem. This paper presents a method for compressing contours by extracting representative points from the original curve. By formulating the point selection problem as a graph theory problem, kn...
متن کاملSignal Compression by Second Order Polynomials and Piecewise Non-interpolating Approximation
In this paper we present a time domain signal compression scheme based on the coding of line segments which are used to approximate the signal. These segments are t in a way that is optimal given the number of retained signal samples. Although the approach is useful for many types of signals, we focus in this paper on compression of ElectroCardioGram (ECG) signals. ECG signal compression has tr...
متن کاملMultiple error measures in ECG data compression
The problem of compressing digital electrocar-diograms (ECG) has traditionally been tackled by heuristic approaches. Recently, it has been demonstrated how techniques based on graph theory can be applied in order to yield optimal compressions. Unlike the conventional methods , the graph algorithms guarantee the minimal reproduction error given some reasonable assumptions. Closeness between orig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1712.05822 شماره
صفحات -
تاریخ انتشار 2017